An Application of Vector Decomposition Problem in Public Key Cryptography Using Homomorphic Encryption
نویسندگان
چکیده
It is known that the security of Public Key Cryptosystems can be based on Vector Decomposition Problem (VDP). In this paper, we analyze this problem. In practice, it was shown that the Computational DiffieHellmann Problem (CDHP) is equivalent to VDP for supersingular elliptic curves. Moreover, VDP on a higher genus curve is hard if CDHP is hard on its one dimensional subspace. We propose an encryption scheme, which is homomorphic in nature, based on VDP.
منابع مشابه
EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملBatch Fully Homomorphic Encryption over the Integers
We extend the fully homomorphic encryption scheme over the integers of van Dijk et al. (DGHV) into a batch fully homomorphic encryption scheme, i.e. to a scheme that supports encrypting and homomorphically processing a vector of plaintexts as a single ciphertext. We present two variants in which the semantic security is based on different assumptions. The first variant is based on a new decisio...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملMulti-integer Somewhat Homomorphic Encryption Scheme with China Remainder Theorem
As an effective solution to protect the privacy of the data, homomorphic encryption has become a hot research topic. Existing homomorphic schemes are not truly practical due to their high computational complexity and huge key size. In 2013, Coron et al. proposed a batch homomorphic encryption scheme, i.e. a scheme that supports encrypting and homomorphically evaluating several plaintext bits as...
متن کاملOn non-abelian homomorphic public-key cryptosystems
An important problem of modern cryptography concerns secret public-key computations in algebraic structures. We construct homomorphic cryptosystems being (secret) epimorphisms f : G → H, where G,H are (publically known) groups and H is finite. A letter of a message to be encrypted is an element h ∈ H, while its encryption g ∈ G is such that f(g) = h. A homomorphic cryptosystem allows one to per...
متن کامل